Incremental composition of static decoding graphs with label pushing
نویسنده
چکیده
We present new results achieved in the application of incremental graph composition algorithm, in particular using the label pushing method to further reduce the final graph size. In our previous work we have shown that the incremental composition is an efficient alternative to the conventional finite state transducer (FST) determinization-composition-minimization approach, with some limitations. One of the limitations was that the word labels must stay aligned with the actual word ends. We describe an updated version of the algorithm which allows us to push the word labels relatively to the word ends to increase the effect of the minimization. The size of resulting graph is now very close to the ones produced by the conventional FST approach with label pushing.
منابع مشابه
Incremental composition of static decoding graphs
A fast, scalable and memory-efficient method for static decoding graph construction is presented. As an alternative to the traditional transducer-based approach, it is based on incremental composition. Memory efficiency is achieved by combining composition, determinization and minimization into a single step, thus eliminating large intermediate graphs. We have previously reported the use of inc...
متن کاملMemory efficient decoding graph compilation with wide cross-word acoustic context
We present an efficient technique for the compilation of static decoding graphs which can utilize full word of left cross-word context. We put an emphasis on memory efficiency, in particular to be able to deploy this technique on platforms with limited resources. The incremental application of the composition process efficiently produces a weighted finite state acceptor which is globally determ...
متن کاملInvestigating The Seismic Response of Structural Walls Using Nonlinear Static and Incremental Dynamic Analyses
Structural walls commonly used as efficient structural elements to resist lateral and vertical loads. Diverse performance of bearing wall system in past earthquakes, motivates investigation on the adequacy of current seismic design provision for these walls. This study considers seismic performance of model walls of bearing wall and building frame systems designed as ordinary and special struct...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملIncremental generation of word graphs
We present an algorithm for the incremental generation of word graphs. Incremental means that the speech signal is processed left-to-right by a time synchronous Viterbi algorithm and word hypotheses are generated with some delay to Viterbi decoding. The incrementally generated word hypotheses can be used for early interaction between linguistic analysis and acoustic recognition. Therefore, it i...
متن کامل